Specializing Trees for E cient Functional Tree Decoration

This paper presents a technique to specialize pure functional programs that perform multiple traversals over a tree. This technique specializes the original tree for the subsequent traversals. Several optimizations which increase program eeciency are presented. The multiple traversal algorithms are described by an Attribute Grammars (AG) and the corresponding functional programs are automatically derived. A functional implementation of a simple AG is presented and rst results are compared with other functional approaches.